An Algorithm for Computing the Limit Points of the Quasi-component of a Regular Chain
نویسندگان
چکیده
For a regular chain R, we propose an algorithm which computes the (non-trivial) limit points of the quasi-component of R, that is, the set W (R) \W (R). Our procedure relies on Puiseux series expansions and does not require to compute a system of generators of the saturated ideal of R. We focus on the case where this saturated ideal has dimension one and we discuss extensions of this work in higher dimensions. We provide experimental results illustrating the benefits of our algorithms.
منابع مشابه
Computing the Limit Points of the Quasi-component of a Regular Chain in Dimension One
For a regular chain R in dimension one, we propose an algorithm which computes the (non-trivial) limit points of the quasi-component of R, that is, the set W (R) \W (R). Our procedure relies on Puiseux series expansions and does not require to compute a system of generators of the saturated ideal of R. We provide experimental results illustrating the benefits of our algorithms.
متن کاملAlgorithms for Computing Limit distributions of Oscillating Systems with Finite Capacity
We address the batch arrival systems with finite capacity under partial batch acceptance strategy where service times or rates oscillate between two forms according to the evolution of the number of customers in the system. Applying the theory of Markov regenerative processes and resorting to Markov chain embedding, we present a new algorithm for computing limit distributions of the number cus...
متن کاملRegular Chains under Linear Changes of Coordinates and Applications
Given a regular chain, we are interested in questions like computing the limit points of its quasi-component, or equivalently, computing the variety of its saturated ideal. We propose techniques relying on linear changes of coordinates and we consider strategies where these changes can be either generic or guided by the input.
متن کاملFormal approach on modeling and predicting of software system security: Stochastic petri net
To evaluate and predict component-based software security, a two-dimensional model of software security is proposed by Stochastic Petri Net in this paper. In this approach, the software security is modeled by graphical presentation ability of Petri nets, and the quantitative prediction is provided by the evaluation capability of Stochastic Petri Net and the computing power of Markov chain. Each...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1302.4688 شماره
صفحات -
تاریخ انتشار 2013